Scalable Self-Stabilization

Scalable self-stabilization

This paper presents a methodology for a synchronous non-reactive distributed system on a tree topology to stabilize from a k-faulty configuration in a time independent of the size n of the system. In the proposed methodology, processes first measure and compare the sizes of the faulty regions, and then use this information to schedule actions in such a way that the size of the faulty regions pr...

Scalable fault-containing self-stabilization in dynamic networks

Self-stabilizing distributed systems provide a high degree of non-masking fault-tolerance. They recover from transient faults of any scale or nature without human intervention. In general, however, the time needed to recover from small-scale transient faults may not differ significantly from the time needed to recover from large-scale transient faults. Bounding the impact of small-scale faults ...

Probabilistic Self-Stabilization

By using concrete scenarios, we present and discuss a new concept of probabilistic Self-Stabilization in Distributed Systems.

Observing locally self-stabilization

Lost in Self-Stabilization

One of the questions addressed here is ”How can a twisted thread correct itself?”. We consider a theoretical model where the studied mathematical object represents a 2D twisted discrete thread linking two points. This thread is made of a chain of agents which are “lost”, i.e. they have no knowledge of the global setting and no sense of direction. Thus, the modifications made by the agents are l...